Problem set

Results: 1590



#Item
421

PY 542: Non-Equilibrium Statistical Physics Problem Set 8, Fall 2011 Reading: This week we will complete the discussion of irreversible adsorption on Tuesday. Please finish reading sections 7.4–7.5 of the text. At the

Add to Reading List

Source URL: physics.bu.edu

- Date: 2011-10-30 13:54:58
    422

    V22: Honors Theory of Computation Problem Set 5 Solutions Problem 1 Solution: Let ML be the Turing machine that recognizes L. This means that on every w ∈ L, ML accepts, and on every x 6∈ L, ML either reject

    Add to Reading List

    Source URL: ftp.cs.nyu.edu

    Language: English - Date: 2010-12-12 10:20:22
      423

      Name: Problem Set 8 Math 4281, Spring 2014 Due: Wednesday, March 26

      Add to Reading List

      Source URL: www-users.math.umn.edu

      Language: English - Date: 2014-03-10 16:52:04
        424

        PY 542: Non-Equilibrium Statistical Physics Problem Set 3 Reading: For this week, we will finish the discussion of the Langevin and Fokker-Planck equations and then turn to first-passage phenomena. Please read, in order

        Add to Reading List

        Source URL: physics.bu.edu

        - Date: 2011-09-17 07:20:21
          425Computational complexity theory / Theory of computation / Complexity classes / Packing problems / NP-complete problems / Bin packing problem / Approximation algorithms / Polynomial-time approximation scheme / Partition problem / NP / NC / Time complexity

          Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

          Add to Reading List

          Source URL: www2.informatik.hu-berlin.de

          Language: English - Date: 2014-06-25 03:14:23
          426

          Problem Set #2 · Phil 5344 · Fall 2012 Instructor: Jc Beall Your answers should be complete and correct; but – note well – they should be as concise as they can be. NB: not all problem sets will be as long as this

          Add to Reading List

          Source URL: homepages.uconn.edu

          Language: English - Date: 2012-09-21 18:18:18
            427

            CS172 Computability & Complexity (Spring’09) Instructor: Mihai Pˇatra¸scu Problem Set 9 GSI: Omid Etesami

            Add to Reading List

            Source URL: www-inst.eecs.berkeley.edu

            Language: English - Date: 2009-04-15 22:11:53
              428

              Ch 25 Spring Quarter 2015 Problem Set 4 due May 14, 2015 unless otherwise indicated, use T = 298 K 1a. (10 pts) Calculate E˚ʼ and E˚ (the standard reduction potentials at pH 7 and pH 0) for the H2O2/H2O electrode (the

              Add to Reading List

              Source URL: www.br.caltech.edu

              Language: English - Date: 2015-05-07 14:33:35
                429

                Honors Theory of Computation Problem Set 2 Solutions Problem 1 Solution: (a) Suppose that L1 = {0n 1m 0n } is regular. Let p be the pumping length given by the pumping

                Add to Reading List

                Source URL: ftp.cs.nyu.edu

                Language: English - Date: 2010-10-23 16:40:50
                  430

                  Weekly-ish Problem #1 · Phil 5307 · Fall 2012 Student: NAME GOES HERE Let us define a language L as follows. • Syntax: 1. A is the set of all atomics; it contains letters p, q with or without numerical subscripts (i.

                  Add to Reading List

                  Source URL: homepages.uconn.edu

                  Language: English - Date: 2012-09-10 17:48:59
                    UPDATE